On the Permutations Generated by Cyclic Shift
نویسنده
چکیده
The set of permutations generated by cyclic shift is studied using a number system coding for these permutations. The system allows to find the rank of a permutation given how it has been generated, and to determine a permutation given its rank. It defines a code describing structural and symmetry properties of the set of permutations ordered according to generation by cyclic shift. The code is associated with an Hamiltonian cycle in a regular weighted digraph. This Hamiltonian cycle is conjectured to be of minimal weight, leading to a combinatorial Gray code listing the set of permutations.
منابع مشابه
Permuting Operations on Strings — Their Permutations and Their Primes
We study some length-preserving operations on strings that only permute the symbol positions in strings. These operations include some well-known examples (reversal, circular or cyclic shift, shuffle, twist) and some new ones based on the Archimedes spiral and on the Josephus problem. Such a permuting operation X gives rise to a family {Xn}n≥2 of similar permutations. We investigate the structu...
متن کاملBallot Permutations in Prêt à Voter
Handling full permutations of the candidate list along with re-encryption mixes is rather difficult in Prêt à Voter but handling cyclic shifts is straightforward. One of the versions of Prêt à Voter that uses Paillier encryption allows general permutations of candidates on the ballot, rather than just cyclic shifts. This improves the robustness of the system against an adversary who tries to al...
متن کاملPermuting operations on strings and their relation to prime numbers
Some length-preserving operations on strings only permute the symbol positions in strings; such an operation X gives rise to a family {Xn}n≥2 of similar permutations. We investigate the structure and the order of the cyclic group generated by Xn. We call an integer n X-prime if Xn consists of a single cycle of length n (n ≥ 2). Then we show some properties of these X-primes, particularly, how X...
متن کاملOn Regularity of Acts
In this article we give a characterization of monoids for which torsion freeness, ((principal) weak, strong) flatness, equalizer flatness or Condition (E) of finitely generated and (mono) cyclic acts and Condition (P) of finitely generated and cyclic acts implies regularity. A characterization of monoids for which all (finitely generated, (mono) cyclic acts are regular will be given too. We als...
متن کاملAbelian codes over Galois rings closed under certain permutations
We study -length Abelian codes over Galois rings with characteristic , where and are relatively prime, having the additional structure of being closed under the following two permutations: i) permutation effected by multiplying the coordinates with a unit in the appropriate mixed-radix representation of the coordinate positions and ii) shifting the coordinates by positions. A code is -quasi-cyc...
متن کامل